A note on the minimum effort control problem

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A minimum effort optimal control problem for the wave equation

A minimum effort optimal control problem for the undamped wave equation is considered which involves L∞–control costs. Since the problem is non-differentiable a regularized problem is introduced. Uniqueness of the solution of the regularized problem is proven and the convergence of the regularized solutions is analyzed. Further, a semi-smooth Newton method is formulated to solve the regularized...

متن کامل

A Novel Experimental Analysis of the Minimum Cost Flow Problem

In the GA approach the parameters that influence its performance include population size, crossover rate and mutation rate. Genetic algorithms are suitable for traversing large search spaces since they can do this relatively fast and because the mutation operator diverts the method away from local optima, which will tend to become more common as the search space increases in size. GA’s are base...

متن کامل

A note on the probabilistic analysis of the minimum set cover problem

In this note we provide a simpler proof of a probabilistic analysis of the set cover problem given in [6]. We also prove these results using the language of high probability instead of using convergence in probability or convergence almost everywhere, making the previous results more precise.

متن کامل

A Note on the Complexity of the Generalized Minimum Spanning Tree Problem

We consider the Generalized Minimum Spanning Tree Problem denoted by GMST. It is known that the GMST problem is NP-hard. We present a stronger result regarding the complexity of the problem, namely, the GMST problem even on trees is NP-hard. As well as we present three cases when the GMST problem is solvable in polynomial time.

متن کامل

A Note On Minimum Path Bases

Given an undirected graph G(V,E) and a vertex subset U ⊆ V the U -space is the vector space over GF(2) spanned by the paths with end-points in U and the cycles in G(V,E). We extend Vismara’s algorithm to the computation of the union of all minimum length bases of the U -space.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Analysis and Applications

سال: 1966

ISSN: 0022-247X

DOI: 10.1016/0022-247x(66)90088-6